Reflections on Boyce-Codd Normal Form

نویسندگان

  • Carol Helfgott
  • D. Scott
چکیده

1. Introduction

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Boyce-Codd-Heath Normal Form for SQL

In the relational model of data the Boyce-Codd-Heath normal form, commonly just known as Boyce-Codd normal form, guarantees the elimination of data redundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints...

متن کامل

Some Problems Related to Keys and the Boyce-Codd Normal Form

The aim of this paper is to investigate the connections between minimal keys and antikeys for special Sperner-systems by hypergraphs. The BoyceCodd normal form and some related problems are also studied in this paper.

متن کامل

Finding Faithful Boyce-Codd Normal Form Decompositions

It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NPhard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach ...

متن کامل

Implementing an Automated Normalization System for Functional Independent Normal Form in Relational Databases

A deductive system for automated database normalization is implemented by using a HiLog reasoning engine. The system allows for checking a relational schema up to Boyce-Codd normal form (BCNF) and functional independency normal form (FINF). Examples of system usage are presented and discussed.

متن کامل

Determination of the normalization level of database schemas through equivalence classes of attributes

In this paper, based on equivalence classes of attributes there are formulated necessary and sufficient conditions that constraint a database schema to be in the second, third or Boyce-Codd normal forms. These conditions offer a polynomial complexity for the testing algorithms of the normalizations level.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998